Bkd-Tree: A Dynamic Scalable kd-Tree

In this paper we propose a new index structure, called the Bkd-tree, for indexing large multi-dimensional point data sets. The Bkdtree is an I/O-efficient dynamic data structure based on the kd-tree. We present the results of an extensive experimental study showing that unlike previous attempts on making external versions of the kd-tree dynamic, the Bkd-tree maintains its high space utilization and excellent query and update performance regardless of the number of updates performed on it.